To Sweep or Not to Sweep

Chaining Fragments in Sequences: to Sweep or Not (Extended Abstract)

Computing an optimal chain of fragments is a classical problem in string algorithms, with important applications in computational biology. There exist two efficient dynamic programming algorithms solving this problem, based on different principles. In the present note, we show how it is possible to combine the principles of two of these algorithms in order to design a hybrid dynamic programming...

Sweep-plane Approach to Bounding Box Intersection

This paper summarises an effort towards approximation of an optimal sweepplane approach to axis aligned bounding box intersection problem. In particular a spatial hash table and priority search tree are combined in order to obtain a data structure suitable for solving two-dimensional dynamic rectangle intersection problem. Some variants of this structure allow logarithmic update and query times...

Implicit Sweep

Mark DURING Sweep rather than Mark THEN Sweep

Garbage Collection frees the programmer from the burden of explicitly deallocating unused data. This facility induces a considerable overhead but also causes some delays that may aaect real-time applications. Guaranteed throughput (with at most short and predictable delays) is needed in many applications such as plane or plant control and requires at least a worst case analysis to identify the ...

Implicit Sweep Surfaces

A technique is presented for generating implicit sweep objects that support direct specification and manipulation of the surface with no topological limitations on the 2D sweep template. The novelty of this method is that the underlying scalar field is bounded and C continuous, apart from surface creases. Bounded scalar fields guarantee local influence when modeling with implicit surfaces, an i...